Symmetry parameters of various hypercube families
نویسندگان
چکیده
In this paper we study the symmetry parameters determining number, distinguishing and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, powers folded enhanced augmented hypercubes locally twisted hypercubes.
منابع مشابه
Various Parameters of Subgraphs and Supergraphs of the Hypercube
OF DISSERTATION Submitted in the partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate School of Arts and Sciences of Northeastern University, April 2009
متن کاملSymmetry and reproducibility of kinematic parameters during various running techniques.
PURPOSE This study examined the validity of the assumption of lower-extremity kinematic parameter reproducibility and symmetry during running with different velocities and stride frequencies. METHODS Each of 12 female long-distance runners ran on a treadmill in combinations of three different velocities (2.5, 3.0, and 3.5 m.s-1) and three different stride frequencies (preferred and +/- 10% fr...
متن کاملOn Embedding Various Networks into the Hypercube Using Matrix Transformations
Various researchers have shown that the binary n-cube (or hypercube) can embed any r-ary m-cubes, having the same number of nodes, with dilation 1. Their construction method is primarily based on the reflected Gray code. We present a different embedding method based on matrix transformations' schemes that achieves the same results. In addition, this method has a nice property that makes it suit...
متن کاملEmbedding various even cycles in a hypercube with node failures
Let fv denote the number of faulty vertices in an n-dimensional hypercube Qn. In this paper, we prove that every fault-free edge of Qn for n ≥ 4 and every fault-free vertex of Qn for n ≥ 3 lies on a fault-free cycle of every even length from 6 to 2 − 2fv inclusive if fv = n− 1, and all faulty vertices are not adjacent to the same vertex.
متن کاملOn Certain Connected Resolving Parameters of Hypercube Networks
Given a graph , a set is a resolving set if for each pair of distinct vertices there is a vertex such that . A resolving set containing a minimum number of vertices is called a minimum resolving set or a basis for . The cardinality of a minimum resolving set is called the resolving number or dimension of and is denoted by . A resolving set is said to be a star resolving set if it induces a star...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The art of discrete and applied mathematics
سال: 2022
ISSN: ['2590-9770']
DOI: https://doi.org/10.26493/2590-9770.1481.29d